Exponential sums and rigid cohomology

In this article, we prove a comparison theorem between the Dwork cohomology introduced by Adolphson and Sperber and the rigid cohomology. As a corollary, we can calculate the rigid cohomology of Dwork isocrystal on torus.     

On the Newton polygons of twisted L-functions of binomials

Let χ be an order c multiplicative character of a finite field and $f(x)=x^d+\lambda x^e$ a binomial with $(d,e)=1$. We study the twisted classical and T-adic Newton polygons of f. When $p>(d-e)(2d-1)$, we give a lower bound of Newton polygons and show that they coincide if p does not divide a certain integral constant depending on $p\mathrm{mod}cd$.We conjecture that this condition holds if p is large enough with respect to $c,d$ by combining all known results and the conjecture given by Zhang-Niu. As an example, we show that it holds for $e=d-1$.     

Corners of self-conjugate (s,s + 1)-cores and (s‾,s+1‾)-cores

In this paper, we describe a result on self-conjugate $(s,s+1)$-core partitions with the fixed number of corners. We also define shifted corners of a distinct partition and find formulas for the number of $(\stackrel{￣}{s},\stackrel{￣}{s+1})$-core partitions and the number of $(s,s+1)$-core shifted Young diagrams with the fixed number of shifted corners.     

The connected partition lattice of a graph and the reconstruction conjecture

Previously we showed that many invariants of a graph can be computed from its abstract induced subgraph poset, which is the isomorphism class of the induced subgraph poset, suitably weighted by subgraph counting numbers. In this paper, we study the abstract bond lattice of a graph, which is the isomorphism class of the lattice of distinct unlabelled connected partitions of a graph, suitably weighted by subgraph counting numbers. We show that these two abstract posets can be constructed from each other except in a few trivial cases. The constructions rely on certain generalisations of a lemma of Kocay in graph reconstruction theory to abstract induced subgraph posets. As a corollary, trees are reconstructible from their abstract bond lattice. We show that the chromatic symmetric function and the symmetric Tutte polynomial of a graph can be computed from its abstract induced subgraph poset. Stanley has asked if every tree is determined up to isomorphism by its chromatic symmetric function. We prove a counting lemma, and indicate future directions for a study of Stanley's question.     

水下对转螺旋桨流致辐射噪声机理与预报方法*

水下对转螺旋桨流致辐射噪声的预报对于水下目标的特征提取和分类识别具有重要意义。由桨叶的旋转引起的湍流场是水下对转螺旋桨流致辐射噪声的源场。分述了水下对转螺旋桨湍流边界层脉动、旋转干涉效应和空化效应引发的水动力噪声机制和研究进展,比较了目前工程应用中的3种对转螺旋桨流致辐射噪声预报方法的特点。在分析对转螺旋桨流致辐射噪声数值预报难点的基础上,综述了对转螺旋桨流致辐射噪声计算方法的研究进展,指出间接数值模拟方法是工程中进行对转螺旋桨流致辐射噪声预报的有效方法。     

Computational and dynamic NMR investigation of 2,2-dimesityl-1,1,1,3,3,3-hexamethyltrisilane

The structure and rotational barrier for the mesityl-silicon bond of 2,2-dimesityl-1,1,1,3,3,3-hexamethyltrisilane have been investigated by ¹H- and ¹³C-variable temperature nuclear magnetic resonance (NMR) as well as by density functional theory structural calculations. The calculations show that the lowest energy structure has C₂ symmetry with nonequivalent ortho methyl groups, consistent with the crystal structure and solution NMR. The nonequivalent ortho methyl groups exchange through a C_s transition state with a calculated relative free energy of 11.0 kcal mol⁻¹. The barrier for this rotation found by dynamic NMR is 13.4 ± 0.2 kcal mol⁻¹ at 298 K.     

Hardy和Littlewood的一个三角和

本文对Hardy和Littlewood考虑的一个有限三角和做了进一步地研究.通过充分运用Chebyshev多项式和M?bius函数的性质,建立了该有限三角和的一个有趣的恒等式,并得到了一个精确的渐近公式.